Interprocedural Reachability for Flat Integer Programs
نویسندگان
چکیده
We study context-free grammars whose generated language is bounded (that is, subset of some expression w ̊ 1 . . . w ̊ d called bounded expression). We investigate the underlying generating process of such language and show that there exists a bounded expression u1 . . . um over the production rules, such that the language is generated only by sequences of production rules conforming to the bounded expression. We give an algorithm to compute such a bounded expression, and an optimal upper bound on its running time. 1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems
منابع مشابه
Fully Automatic Verification of Absence of Errors via Interprocedural Integer Analysis
We present a interprocedural C String Static Verifier (iCSSV), a whole program analysis algorithm for verifying the safety of string operations in C programs. The algorithm automatically proves linear relationships among pointer expressions. The algorithm is conservative, i.e., it infers only valid relationships although it may fail to detect some of them. The algorithm is targeted to programs ...
متن کاملInterprocedural Shape Analysis with Separated Heap Abstractions
We describe an interprocedural shape analysis that makes use of spatial locality (i.e. the fact that most procedures modify only a small subset of the heap) in its representation of abstract states. Instead of tracking reachability information directly and aliasing information indirectly, our representation tracks reachability indirectly and aliasing directly. Computing the effect of procedure ...
متن کاملFaster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth
Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring, and path properties are algebraic with semiring operations. RSMs with algebraic...
متن کاملConcurrency Analysis for Parallel Programs with Textually Aligned Barriers
A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to control flow analysis on serial programs and is useful in detecting parallel programming errors and as a precursor to semantics-preserving code transformations. We consider the problem of analyzing parallel programs that access...
متن کاملProperty Directed Reachability for Proving Absence of Concurrent Modification Errors
We define and implement an interprocedural analysis for automatically checking safety of recursive programs with an unbounded state space. The main idea is to infer modular universally quantified inductive invariants in the form of procedure summaries that are sufficient to prove the safety property. We assume that the effect of the atomic commands of the program can be modeled via effectively ...
متن کامل